Minimal divergence for border rank-2 tensor approximation
نویسندگان
چکیده
منابع مشابه
Low-rank Tensor Approximation
Approximating a tensor by another of lower rank is in general an ill posed problem. Yet, this kind of approximation is mandatory in the presence of measurement errors or noise. We show how tools recently developed in compressed sensing can be used to solve this problem. More precisely, a minimal angle between the columns of loading matrices allows to restore both existence and uniqueness of the...
متن کاملRelative Error Tensor Low Rank Approximation
We consider relative error low rank approximation of tensors with respect to the Frobenius norm. Namely, given an order-q tensor A ∈ R ∏q i=1 ni , output a rank-k tensor B for which ‖A − B‖F ≤ (1 + ) OPT, where OPT = infrank-k A′ ‖A − A‖F . Despite much success on obtaining relative error low rank approximations for matrices, no such results were known for tensors. One structural issue is that ...
متن کاملun 2 00 9 Subtracting a best rank - 1 approximation may increase tensor rank
It has been shown that a best rank-R approximation of an order-k tensor may not exist when R ≥ 2 and k ≥ 3. This poses a serious problem to data analysts using tensor decompositions. It has been observed numerically that, generally, this issue cannot be solved by consecutively computing and subtracting best rank-1 approximations. The reason for this is that subtracting a best rank-1 approximati...
متن کاملThe Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-2 Tensor∗
The ability to approximate a multivariate function/tensor as a sum of separable functions/tensors is quite useful, but algorithms to do so exhibit unpleasantly interesting behavior known as swamps. Such swamps have been the bane of users for decades and need to be understood so they can be alleviated. In previous work, we developed and applied dynamical systems concepts to analyze the simplest ...
متن کاملTensor Low Multilinear Rank Approximation by Structured Matrix Low-Rank Approximation
We present a new connection between higherorder tensors and affinely structured matrices, in the context of low-rank approximation. In particular, we show that the tensor low multilinear rank approximation problem can be reformulated as a structured matrix low-rank approximation, the latter being an extensively studied and well understood problem. We first consider symmetric tensors. Although t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 2021
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081087.2021.1901842